近年来,商业上可用和负担得起的四足动物机器人激增,其中许多平台在研究和行业中都被积极使用。随着腿部机器人的可用性的增长,对这些机器人能够执行有用技能的控制器的需求也是如此。但是,大多数用于控制器开发的基于学习的框架都集中在培训机器人特定的控制器上,该过程需要为每个新机器人重复。在这项工作中,我们引入了一个用于训练四足机器人的广义运动(Genloco)控制器的框架。我们的框架合成了可以部署在具有相似形态的各种四足动物的机器人上的通用运动控制器。我们提出了一种简单但有效的形态随机化方法,该方法在程序上生成了一组训练的模拟机器人。我们表明,通过对这套模拟机器人进行训练,我们的模型获得了更多的通用控制策略,这些策略可以直接转移到具有多种形态的新型模拟和真实世界机器人中,在训练过程中未观察到。
translated by 谷歌翻译
本文提出了一个最佳的运动计划框架,以自动生成多功能的四足动物跳跃运动(例如,翻转,旋转)。通过质心动力学的跳跃运动被配制为受机器人基诺动力约束的12维黑盒优化问题。基于梯度的方法在解决轨迹优化方面取得了巨大成功(TO),但是,需要先验知识(例如,参考运动,联系时间表),并导致次级最佳解决方案。新提出的框架首先采用了基于启发式的优化方法来避免这些问题。此外,针对机器人地面反作用力(GRF)计划中的基于启发式算法的算法创建了优先级的健身函数,增强收敛性和搜索性能。由于基于启发式的算法通常需要大量的时间,因此计划离线运动并作为运动前库存储。选择器旨在自动选择用用户指定或感知信息作为输入的动作。该框架仅通过几项具有挑战性的跳跃动作在开源迷你室中的简单连续跟踪PD控制器进行了成功验证,包括跳过30厘米高度的窗户形状的障碍物,并在矩形障碍物上与左悬挂式障碍物。 27厘米高。
translated by 谷歌翻译
深度神经网络可以捕获查询和文档之间的复杂交互历史信息,因为它们的许多复杂的非线性单元,使它们能够提供正确的搜索建议。但是,在现实情况下,服务提供商经常面临更复杂的障碍,例如部署成本限制和公平要求。已经提出了将训练有素的复杂模型(教师)转移到简单模型(学生)的知识的知识蒸馏,以减轻前者的关注,但最佳当前蒸馏方法仅着重于如何使学生模型模仿教师模型的预测。为了更好地促进深层模型的应用,我们建议基于知识蒸馏的公平信息检索框架。该框架可以改善模型的基于暴露的公平性,同时大大降低模型大小。我们在三个巨大数据集上进行的广泛实验表明,我们提出的框架可以将模型尺寸降低到其原始尺寸的最小1%,同时保持其黑盒状态。它还将公平性能提高15%〜46%,同时保持高水平的建议效率。
translated by 谷歌翻译
在自然语言处理中,广泛使用黑框模型为对决策基础的理解,预测结果的可信度以及改善模型性能带来了巨大挑战。文本样本中的单词具有反映其语义和上下文信息的属性,例如语音,位置等。这些属性可能与显着性一词具有一定的关系,这有助于研究模型的解释性预测。在本文中,我们探讨了“显着性”一词和属性一词之间的关系。根据分析结果,我们进一步建立了一个映射模型Seq2Sality,从文本样本中的单词及其属性到基于序列标记的概念的显着性值。此外,我们建立了一个名为PRSALM的新数据集,该数据集包含文本示例中的每个单词,单词属性和单词显着性值。进行实验评估以分析具有不同特性的单词的显着性。验证了SEQ2Sality模型的有效性。
translated by 谷歌翻译
最近,事物的人工智能(Aiot)一直在引起人们的关注,具有通过事物的网络连接提供高度智能服务的有趣愿景,从而导致了先进的AI驱动生态。但是,对数据隐私的最新监管限制排除将敏感的本地数据上传到数据中心,并以集中式方法利用它们。在这种情况下,直接应用联合学习算法几乎不能满足效率和准确性的工业要求。因此,我们在面部识别应用方面为AIOT提出了一个有效的工业联合学习框架。具体而言,我们建议利用转移学习的概念来加快设备上的联合培训,并进一步介绍私人投影仪的新颖设计,该设计有助于保护共享梯度,而不会产生额外的记忆消耗或计算成本。对亚洲私人面部数据集的实证研究表明,我们的方法仅在20轮沟通中就可以实现高认识的准确性,这表明了其在预测和培训方面的有效性。
translated by 谷歌翻译
在本文中,我们旨在提供有效的成对学习神经链路预测(PLNLP)框架。该框架将链路预测视为对等级问题的成对学习,包括四个主要组件,即邻域编码器,链路预测器,负采样器和目标函数组成。该框架灵活地,任何通用图形神经卷积或链路预测特定神经结构都可以作为邻域编码器。对于链路预测器,我们设计不同的评分功能,可以基于不同类型的图表来选择。在否定采样器中,我们提供了几种采样策略,这些策略是特定的问题。至于目标函数,我们建议使用有效的排名损失,这大约最大化标准排名度量AUC。我们在4个链路属性预测数据集上评估了开放图基准的4个链接属性预测数据集,包括\ texttt {ogbl-ddi},\ texttt {ogbl-collbab},\ texttt {ogbl-ppa}和\ texttt {ogbl-ciation2}。 PLNLP在\ TextTt {ogbl-ddi}上实现前1个性能,以及仅使用基本神经架构的\ texttt {ogbl-collab}和\ texttt {ogbl-ciation2}的前2个性能。该性能展示了PLNLP的有效性。
translated by 谷歌翻译
在本文中,我们提出了FXAM(快速可解释的添加剂模型),统一和快速可解释模型的预测分析。 FXAM将GAM的(广义添加剂模型)扩展到具有统一添加剂模型的模型,用于数值,分类和时间特征。 FXAM进行一种新颖的培训程序,称为三级迭代(TSI)。三个阶段分别对应于学习数值,分类和时间特征。通过固定其他阶段的参数,每个阶段都学习本地最佳。我们设计联合学习过度学习,占时间特征的部分学习,以实现高精度和培训效率。我们证明了TSI保证融合到全球最优。我们进一步提出了一套优化技术来加速FXAM的培训算法,以满足交互式分析的需求。评估验证FXAM在训练速度和建模分类和时间特征方面显着优于现有的游戏。
translated by 谷歌翻译
The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.
translated by 谷歌翻译
Interview has been regarded as one of the most crucial step for recruitment. To fully prepare for the interview with the recruiters, job seekers usually practice with mock interviews between each other. However, such a mock interview with peers is generally far away from the real interview experience: the mock interviewers are not guaranteed to be professional and are not likely to behave like a real interviewer. Due to the rapid growth of online recruitment in recent years, recruiters tend to have online interviews, which makes it possible to collect real interview data from real interviewers. In this paper, we propose a novel application named EZInterviewer, which aims to learn from the online interview data and provides mock interview services to the job seekers. The task is challenging in two ways: (1) the interview data are now available but still of low-resource; (2) to generate meaningful and relevant interview dialogs requires thorough understanding of both resumes and job descriptions. To address the low-resource challenge, EZInterviewer is trained on a very small set of interview dialogs. The key idea is to reduce the number of parameters that rely on interview dialogs by disentangling the knowledge selector and dialog generator so that most parameters can be trained with ungrounded dialogs as well as the resume data that are not low-resource. Evaluation results on a real-world job interview dialog dataset indicate that we achieve promising results to generate mock interviews. With the help of EZInterviewer, we hope to make mock interview practice become easier for job seekers.
translated by 谷歌翻译
Dynamic treatment regimes assign personalized treatments to patients sequentially over time based on their baseline information and time-varying covariates. In mobile health applications, these covariates are typically collected at different frequencies over a long time horizon. In this paper, we propose a deep spectral Q-learning algorithm, which integrates principal component analysis (PCA) with deep Q-learning to handle the mixed frequency data. In theory, we prove that the mean return under the estimated optimal policy converges to that under the optimal one and establish its rate of convergence. The usefulness of our proposal is further illustrated via simulations and an application to a diabetes dataset.
translated by 谷歌翻译